Statistics on Graphs, Exponential Formula and Combinatorial Physics

نویسندگان

  • Laurent Poinsot
  • Gérard Duchamp
  • Silvia Goodenough
  • Karol A. Penson
چکیده

The concern of this paper is a famous combinatorial formula known under the name “exponential formula”. It occurs quite naturally in many contexts (physics, mathematics, computer science). Roughly speaking, it expresses that the exponential generating function of a whole structure is equal to the exponential of those of connected substructures. Keeping this descriptive statement as a guideline, we develop a general framework to handle many different situations in which the exponential formula can be applied.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Computation of Baker and Norine's Rank on Complete Graphs

The paper by M. Baker and S. Norine in 2007 introduced a new parameter on configurations of graphs and gave a new result in the theory of graphs which has an algebraic geometry flavor. This result was called Riemann-Roch formula for graphs since it defines a combinatorial version of divisors and their ranks in terms of configurations on graphs. The so called chip firing game on graphs and the s...

متن کامل

Some Algebraic and Combinatorial Properties of the Complete $T$-Partite Graphs

In this paper, we characterize the shellable complete $t$-partite graphs. We also show for these types of graphs the concepts vertex decomposable, shellable and sequentially Cohen-Macaulay are equivalent. Furthermore, we give a combinatorial condition for the Cohen-Macaulay complete $t$-partite graphs.

متن کامل

Permutations and Coin-Tossing Sequences

This quote is from Herbert Wilf's delightful book generatingfunctionology [1, p. 75]. It occurs in the chapter on the exponential formula, a powerful technique for counting labelled structures formed from "connected" components. Such structures include various types of graphs, permutations (formed from cycles), and partitions (a union of blocks). Applied to permutations on n letters comprising ...

متن کامل

Cohomology of Feynman graphs and L-infinity algebra

The goal of the proposed research is twofold: 1) it will define and investigate the cohomology of Feynman graphs, investigating the relation to the moduli space of L-infinity morphisms; 2) based on the results and experience gained, the existence of a combinatorial formula for the coefficients of Kontsevich formula for the star product in the deformation quantization of Poisson manifolds will b...

متن کامل

Spectral Statistics for Quantum Graphs: Periodic Orbits and Combinatorics

We consider the Schrödinger operator on graphs and study the spectral statistics of a unitary operator which represents the quantum evolution, or a quantum map on the graph. This operator is the quantum analogue of the classical evolution operator of the corresponding classical dynamics on the same graph. We derive a trace formula, which expresses the spectral density of the quantum operator in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/0910.0695  شماره 

صفحات  -

تاریخ انتشار 2009